Fast and Simple Relational Processing of Uncertain Data

This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical partitioning. If we consider positive relational algebra extended by an operation for computing possible answers, a query on the logical level can be translated into, and evaluated as, a single relational algebra query on the U-relation representation. The translation scheme essentially preserves the size of the query in terms of number of operations and, in particular, number of joins. Standard techniques employed in off-the-shelf relational database management systems are effective for optimizing and processing queries on U-relations. In our experiments we show that query evaluation on U-relations scales to large amounts of data with high degrees of uncertainty.Comment: 12 pages, 14 figure

Simulation Subsumption or Déjà vu on the Web

Simulation unification is a special kind of unification adapted to retrieving semi-structured data on the Web. This article introduces simulation subsumption, or containment, that is, query subsumption under simulation unification. Simulation subsumption is crucial in general for query optimization, in particular for optimizing pattern-based search engines, and for the termination of recursive rule-based web languages such as the XML and RDF query language Xcerpt. This paper first motivates and formalizes simulation subsumption. Then, it establishes decidability of simulation subsumption for advanced query patterns featuring descendant constructs, regular expressions, negative subterms (or subterm exclusions), and multiple variable occurrences. Finally, we show that subsumption between two query terms can be decided in O(n!n) where n is the sum of the sizes of both query terms

A brief review on micro-implants and their use in orthodontics and dentofacial orthopaedics

The aim of this study was to review the literature and evaluate the failure rates and factors that affect the stability and success of temporary anchorage devices (TADs) used as orthodontic anchorage. Data was collected from electronic databases: MEDLINE database and Google Scholar. Four combinations of term were used as keywords: \u201cmicro-implant\u201d, \u201cmini-implant\u201d, \u201cmini-screw\u201d, and \u201corthodontics\u201d. The following selection criteria were used to select appropriate articles: articles on implants and screws used as orthodontic anchorage, published in English, with both prospective and retrospective clinical and experimental investigations. The search provided 209 abstracts about TADs used as anchorage. After reading and applying the selection criteria, 66 articles were included in the study. The data obtained were divided into two topics: which factors affected TAD success rate and to what degree and in how many articles they were quoted. Clinical factors were divided into three main groups: patient-related, implant related, and management-related factors. Although all articles included in this meta-analysis reported success rates of greater than 80 percent, the factors determining success rates were inconsistent between the studies analyzed and this made conclusions difficult

Equivalence-Invariant Algebraic Provenance for Hyperplane Update Queries

The algebraic approach for provenance tracking, originating in the semiring model of Green et. al, has proven useful as an abstract way of handling metadata. Commutative Semirings were shown to be the "correct" algebraic structure for Union of Conjunctive Queries, in the sense that its use allows provenance to be invariant under certain expected query equivalence axioms. In this paper we present the first (to our knowledge) algebraic provenance model, for a fragment of update queries, that is invariant under set equivalence. The fragment that we focus on is that of hyperplane queries, previously studied in multiple lines of work. Our algebraic provenance structure and corresponding provenance-aware semantics are based on the sound and complete axiomatization of Karabeg and Vianu. We demonstrate that our construction can guide the design of concrete provenance model instances for different applications. We further study the efficient generation and storage of provenance for hyperplane update queries. We show that a naive algorithm can lead to an exponentially large provenance expression, but remedy this by presenting a normal form which we show may be efficiently computed alongside query evaluation. We experimentally study the performance of our solution and demonstrate its scalability and usefulness, and in particular the effectiveness of our normal form representation

Tribological characterisation of magnetron sputtered Ti(C, O, N) thin films

Ti(C, O, N) thin films were prepared by magnetron sputtering and analysed in terms of their tribological properties. Surface and tribological parameters were analysed and discussed as a function of the films composition and structural features, as well as their thickness. The evolution of friction coefficient values was in concordance with the wear behaviour of the films. According to the atomic composition of the films, an increasing of the carbon percentage and a compound chemical formula closed to the stoichiometric TiC lead to a very good wear behaviour. This aspect is also directly correlated with the friction behaviour.Fundação para a Ciência e Tecnologia (FCT) SFRH/BPD/27114/2006 e PTDC/CTM/69362/200

Compacting XML Structures Using a Dynamic Labeling Scheme

Abstract. Due to the growing popularity of XML as a data exchange and storage format, the need to develop efficient techniques for stor-ing and querying XML documents has emerged. A common approach to achieve this is to use labeling techniques. However, their main prob-lem is that they either do not support updating XML data dynamically or impose huge storage requirements. On the other hand, with the ver-bosity and redundancy problem of XML, which can lead to increased cost for processing XML documents, compaction of XML documents has be-come an increasingly important research issue. In this paper, we propose an approach called CXDLS combining the strengths of both, labeling and compaction techniques. Our approach exploits repetitive consecu-tive subtrees and tags for compacting the structure of XML documents by taking advantage of the ORDPATH labeling scheme. In addition it stores the compacted structure and the data values separately. Using our proposed approach, it is possible to support efficient query and update processing on compacted XML documents and to reduce storage space dramatically. Results of a comprehensive performance study are provided to show the advantages of CXDLS.

An edge-queued datagram service for all datacenter traffic

Modern datacenters support a wide range of protocols and in-network switch enhancements aimed at improving performance. Unfortunately, the resulting protocols often do not coexist gracefully because they inevitably interact via queuing in the network. In this paper we describe EQDS, a new datagram service for datacenters that moves almost all of the queuing out of the core network and into the sending host. This enables it to support multiple (conflicting) higher layer protocols, while only sending packets into the network according to any receiver-driven credit scheme. EQDS can transparently speed up legacy TCP and RDMA stacks, and enables transport protocol evolution, while benefiting from future switch enhancements without needing to modify higher layer stacks. We show through simulation and multiple implementations that EQDS can reduce FCT of legacy TCP by 2x, improve the NVMeOF-RDMA throughput by 30%, and safely run TCP alongside RDMA on the same network

PO-0638: Adaptive dose painting by numbers for head and neck cancer: interim analysis of a randomised trial

International audience1. Recherches sur le Fayuan zayuan yuanshi ji de Sengyou (445-518), première anthologie de rites bouddhiques (suite : le contenu des juan 4 et 5) Notre travail de reconstruction du Fayuan zayuan yuanshi ji 法苑雜緣原始集 (Anthologie [pour comprendre] le commencement et l’origine de diverses [pratiques] dans le jardin des devoirs ; ci-après Fayuan) de Sengyou 僧祐 (445-518) nous a amenés cette année à nous pencher sur les 22 premiers titres de la section sur le saṃgha (Sengbao 僧寶, « Le joyau de la Loi ..